Regular Languages Defined with Generalized Quantifiers
نویسندگان
چکیده
منابع مشابه
Query Languages with Generalized Quantifiers
Various existing query languages allow queries with embedded sub-queries as well as sub-query comparison statements. It is often argued that these features enhance the declarativeness of the query language. We establish a link between between the phenomenon of sub-query syntax in query languages and the theory of generalized quantifiers as it was introduced by Barwise and Cooper in linguistics....
متن کاملRegular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
متن کاملRegular Languages Definable by Majority Quantifiers with Two Variables
In this paper we consider the class of all regular languages definable by the extended majority quantifier and the order predicate but using only two variables. The main part of the paper is the presentation of a geometric method which is used to show that a given regular language cannot be defined by such formulas. Applying this method we can give a necessary condition in terms of an equation ...
متن کاملScope Dominance with Generalized Quantifiers
When two quantifiers Q1 and Q2 satisfy the scheme Q1x Q2y φ → Q2y Q1x φ, we say that Q1 is scopally dominant over Q2. This relation is central in analyzing and computing entailment relations between different readings of ambiguous sentences in natural language. This paper reviews the known results on scope dominance and mentions some open problems.
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1067